LR and L+R systems

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

LR - parsing

LR-parsing Kyung-Goo Doh, Hyunha Kim, David A. Schmidt 1 Hanyang University, Ansan, South Korea 2 Kansas State University, Manhattan, Kansas, USA Abstract. We combine LR(k)-parsing technology and data-flow analysis to analyze, in advance of execution, the documents generated dynamically by a program. Based on the document language’s context-free reference grammar and the program’s control struc...

متن کامل

Notes on Lr Parser Design Christer Samuelsson 2 Lr Parsing

1 INTRODUCTION This paper discusses the design of an LR parser for a speciic high-coverage English grammar. The design principles, though, are applicable to a large class of uniication-based grammars where the constraints are realized as Prolog terms and applied monotonically through instantiation, where there is no right movement , and where left movement is handled by gap threading. The LR pa...

متن کامل

LR-visibility in Polygons

We give a linear-time algorithm which, for a simple polygon P, computes all pairs of points s and t on P that admit LR-visibility. The points s and t partition P into two subchains. We say that P is LR-visible with respect to s and t if each point of P on the chain from s to t is visible from some point of the chain from t to s and vice-versa.

متن کامل

LR-Parsing Derived

The LR(k)-parsing algorithm is derived, i.e., presented and proved as an interplay between program development and parsing theory. The program development uses invariants and the new concept of weakest angelic precondition. The parsing theory involved relates rightmost derivability to three other transitive relations on strings. The usual stack of item sets and the finite automaton appear in an...

متن کامل

LR Parsing for LCFRS

LR parsing is a popular parsing strategy for variants of Context-Free Grammar (CFG). It has also been used for mildly context-sensitive formalisms, such as Tree-Adjoining Grammar. In this paper, we present the first LRstyle parsing algorithm for Linear ContextFree Rewriting Systems (LCFRS), a mildly context-sensitive extension of CFG which has received considerable attention in the last years.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical

سال: 2009

ISSN: 1751-8113,1751-8121

DOI: 10.1088/1751-8113/42/22/225202